AlgoWikiAlgoWiki

  • Home
  • All pages
  • Categories
  • Help

Category: Graph theory

  • BEST theorem
  • Bipartite graph
  • Bipartite matching
  • Bisimilarity
  • Cactus graph
  • Chinese postman problem
  • Chromatic polynomial
  • Closure problem
  • DFA equivalence
  • DFA minimization
  • Dilworth's theorem
  • Eulerian cycle
  • Functional graph
  • Graph center
  • Graph isomorphism
  • Hall's marriage theorem
  • Kirchhoff's matrix tree theorem
  • Kőnig's theorem
  • Longest path problem
  • Lovász toggle
  • Maximum density subgraph
  • Maximum flow
  • Minimum Steiner tree
  • Minimum cut
  • Minimum spanning tree
  • Path cover
  • Pseudoforest
  • Stable marriage problem
  • Subtree compression
  • Topological sorting
  • Vertex-disjoint cycle cover
  • Vertex-disjoint path cover
AlgoWikiCC-BY-SA 4.0| fork us on GitHub